Generalized rate-code model for neuron ensembles with finite populations
نویسندگان
چکیده
منابع مشابه
Generalized rate-code model for neuron ensembles with finite populations.
We have proposed a generalized Langevin-type rate-code model subjected to multiplicative noise, in order to study stationary and dynamical properties of an ensemble containing a finite number N of neurons. Calculations using the Fokker-Planck equation have shown that, owing to the multiplicative noise, our rate model yields various kinds of stationary non-Gaussian distributions such as Gamma , ...
متن کامل2 0 M ar 2 00 7 1 A Generalized Rate Model for Neuronal Ensembles
There has been a long-standing controversy whether information in neuronal networks is carried by the firing rate code or by the firing temporal code. The current status of the rivalry between the two codes is briefly reviewed with the recent studies such as the brain-machine interface (BMI). Then we have proposed a generalized rate model based on the finite N-unit Langevin model subjected to a...
متن کاملan appropriate model for exchange rate predictability in iran: comparing potential forecastability
nowadays in trade and economic issues, prediction is proposed as the most important branch of science. existence of effective variables, caused various sectors of the economic and business executives to prefer having mechanisms which can be used in their decisions. in recent years, several advances have led to various challenges in the science of forecasting. economical managers in various fi...
Generalized modified linear systematic sampling scheme for finite populations
The present paper deals with a further modification on the selection of linear systematic sample, which leads to the introduction of a more generalized form of modified linear systematic sampling namely generalized modified linear systematic sampling (GMLSS) scheme, which is applicable for any sample size, irrespective of the population size whether it is a multiple of sample size or not. The p...
متن کاملPunctured Turbo Code Ensembles
We analyze the asymptotic performance of punctured turbo codes. The analysis is based on the union bound on the word error probability of maximum likelihood decoding for a punctured turbo code ensembles averaged over all possible puncturing patterns and interleavers. By using special probabilistic puncturing, we prove that, for a given mother turbo code ensemble [C] with a finite noise threshol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2007
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.75.051904